Down the Borel Hierarchy: Solving Muller Games via Safety Games
نویسندگان
چکیده
منابع مشابه
Down the Borel hierarchy: Solving Muller games via safety games
We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player. This yields a novel antichain-based memory structure and a natural notion of permissive strategies for Muller games. Moreover, we generalize our construction by presenting a new ...
متن کاملSolving Muller Games via Safety Games
We show how to transform a Muller game with n vertices into a safety game with (n!) vertices whose solution allows to determine the winning regions of the Muller game and a winning strategy for one player.
متن کاملSecure Programming via Safety Games
Writing secure programs remains an open, challenging, and important problem. However, new operating systems allow application programs to write secure programs with a tractable amount of effort. Such systems define a notion of privilege and provide a set of system calls, or primitives, that a program can invoke to manage its privilege and the privileges of other programs with which it interacts...
متن کاملComplexity Bounds for Muller Games
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and succinctness of different types of winning conditions can be compared. We show that the problem of deciding the winner in Muller games is Pspace-complete. This is then used to establish Pspacecompleteness for Emerson-Lei games and for games described by Zielonka DAGs. A...
متن کاملStochastic Games with Borel Payoffs
Thus H∞ = (A×B × S)× (A×B × S)× . . . . Let f be a bounded Borel-measurable function defined on H∞, where the sets A,B, and S are given the discrete topology and H∞ is given the product topology. The stochastic game S(f)(z) begins at state z ∈ S, player 1 chooses a strategy σ, player 2 chooses a strategy τ , and then 2 pays 1 the expected value of f , namely Ez,σ,τf . Theorem 1 (Martin [5]) The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.96.13